On the mixed domination problem in graphs
نویسندگان
چکیده
منابع مشابه
On the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملPower Domination Problem in Graphs
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in graph theory. A set S is a power dominating set (PDS) of a graph G = (V,E), if every vertex and every edge in the system is observed following the observation rules of power system monitoring. The minimum cardinality of ...
متن کاملOn the signed Roman edge k-domination in graphs
Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...
متن کاملOn fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width
A mixed dominating set for a graph G = (V,E) is a set S ⊆ V ∪ E such that every element x ∈ (V ∪E)\S is either adjacent or incident to an element of S. The mixed domination number of a graphG, denoted by γm(G), is the minimum cardinality of mixed dominating sets ofG and any mixed dominating set with cardinality of γm(G) is called a minimum mixed dominating set. The mixed domination problem is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.11.035